package leetcode.code0795;

public class Solution extends Solution795 {

	@Override
	public int numSubarrayBoundedMax(int[] nums, int left, int right) {
		int Len = nums.length;
		int ans = 0;
		int[][] dp = new int[Len + 1][Len + 1];
		for (int i = 1; i <= Len; i++) {

		}
		return dp[0][Len];
	}

	public static void main(String[] args) {
		Solution so = new Solution();
		so.debug3();
//		D.debug14(so);

	}

}
